Understanding TraÆc Dynamics at a Backbone POP
نویسندگان
چکیده
Spatial and temporal information about traÆc dynamics is central to the design of e ective traÆc engineering practices for IP backbones. In this paper we study backbone traÆc dynamics using data collected at a major POP on a tier-1 IP backbone. We develop a methodology that combines packet-level traces from access links in the POP and BGP routing information to build components of POP-to-POP traÆc matrices. Our results show that there is wide disparity in the volume of traÆc headed towards di erent egress POPs. At the same time, we nd that current routing practices in the backbone tend to constrain traÆc between ingress-egress POP pairs to a small number of paths. As a result, there is a wide variation in the utilization level of links in the backbone. Frequent capacity upgrades of the heavily used links are expensive; the need for such upgrades can be reduced by designing load balancing policies that will route more traÆc over less utilized links. We identify traÆc aggregates based on destination address pre xes and nd that this set of criteria isolates a few aggregates that account for an overwhelmingly large portion of inter-POP traÆc. We also demonstrate that these aggregates exhibit stability throughout the day on per-hour time scales, and thus they form a natural basis for splitting traÆc over multiple paths in order to improve load balancing.
منابع مشابه
Internet TraÆc Shaping for IP over WDM Links with Source Output Bu ering or Multiple Parallel Wavelengths
Since the number of wavelengths per ber is growing in an exponential fashion the overow traÆc can be routed through over ow lightpaths, thus providing an ideal network with near-in nite capacity and almost no-bu ering. Such unprecedented bandwidth growth in the network backbone is only limited by the processing speed of the electronic elements. Even though multiple parallel high-speed channels ...
متن کاملA Novel, Generic Graph Model for TraÆc Grooming in Heterogeneous WDM Mesh Networks
As the operation of our ber-optic backbone networks migrates from interconnected SONET rings to arbitrary mesh topology, traÆc grooming on WDM mesh networks becomes an extremely important research problem. To address this problem, we propose a new, generic graph model for traÆc grooming in heterogeneous WDM mesh networks. The novelty of our model is that, by only manipulating the edges of the a...
متن کاملDynamic constrained multipath routing for MPLS networks
|Multipath routing employs multiple parallel paths between a traÆc source and destination in order to relax the most heavily congested link in Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than...
متن کاملDynamic Constrained Traffic Engineering for Multicast Routing
This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwidth c...
متن کاملExplicit multicast routing algorithms for constrained traffic engineering
|This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where the routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwi...
متن کامل